import collections
class Solution(object):
    def minSteps(self, s, t):
        c1 = collections.Counter(s)
        c2 = collections.Counter(t)
        ans = 0
        for key in c1:
            if c1[key] > c2[key]:
                ans += c1[key] - c2[key]
        for key in c2:
            if c2[key] > c1[key]:
                ans += c2[key] - c1[key]
        return ans